On arithmetical algorithms over finite fields
نویسندگان
چکیده
منابع مشابه
Arithmetical definability over finite structures
Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform and . We prove finite analogs of three classic results in arithmetical definability, namely that and TIMES can first-order define PLUS, that and DIVIDES can first-order define TIM...
متن کاملClassical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملOn Symmetric Algorithms for Bilinear Forms over Finite Fields
In this paper we study the computation of symmetric systems of bilinear forms over finite fields via symmetric bilinear algorithms. We show that, in general, the symmetric complexity of a system is upper bounded by a constant multiple of the bilinear complexity; we characterize symmetric algorithms in terms of the cosets of a specific cyclic code, and we show that the problem of finding an opti...
متن کاملSolving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications
Polynomial systems can be used to formulate a large variety of non-linear problems. Polynomial systems over finite fields are of particular interest because of their applications in Cryptography, Coding Theory, and other areas of information science and technologies. Solving polynomial systems is a central topic in Computer Algebra and has stimulated the development in this area. In this thesis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1989
ISSN: 0097-3165
DOI: 10.1016/0097-3165(89)90020-4